math/big.Int.neg (field)

157 uses

	math/big (current package)
		float.go#L608: 	z.neg = x.neg
		float.go#L1110: 		z.neg = x.neg
		float.go#L1150: 		z.a.neg = x.neg
		int.go#L34: 	neg bool // sign
		int.go#L51: 	if x.neg {
		int.go#L65: 	z.neg = neg
		int.go#L72: 	z.neg = false
		int.go#L91: 	return &Int{neg: x < 0, abs: abs}
		int.go#L98: 		z.neg = x.neg
		int.go#L122: 	z.neg = false
		int.go#L129: 	z.neg = false
		int.go#L136: 	z.neg = len(z.abs) > 0 && !z.neg // 0 has no sign
		int.go#L142: 	neg := x.neg
		int.go#L143: 	if x.neg == y.neg {
		int.go#L157: 	z.neg = len(z.abs) > 0 && neg // 0 has no sign
		int.go#L163: 	neg := x.neg
		int.go#L164: 	if x.neg != y.neg {
		int.go#L178: 	z.neg = len(z.abs) > 0 && neg // 0 has no sign
		int.go#L198: 		z.neg = false
		int.go#L202: 	z.neg = len(z.abs) > 0 && x.neg != y.neg // 0 has no sign
		int.go#L224: 	z.neg = neg
		int.go#L275: 	z.neg = len(z.abs) > 0 && x.neg != y.neg // 0 has no sign
		int.go#L284: 	z.neg = len(z.abs) > 0 && x.neg // 0 has no sign
		int.go#L301: 	z.neg, r.neg = len(z.abs) > 0 && x.neg != y.neg, len(r.abs) > 0 && x.neg // 0 has no sign
		int.go#L309: 	y_neg := y.neg // z may be an alias for y
		int.go#L312: 	if r.neg {
		int.go#L332: 	if z.neg {
		int.go#L333: 		if y0.neg {
		int.go#L362: 	if m.neg {
		int.go#L363: 		if y0.neg {
		int.go#L386: 	case x.neg == y.neg:
		int.go#L388: 		if x.neg {
		int.go#L391: 	case x.neg:
		int.go#L431: 	if x.neg {
		int.go#L447: 		return w >= 0 || x.neg && w == -w
		int.go#L454: 	return !x.neg && len(x.abs) <= 64/_W
		int.go#L468: 		if x.neg {
		int.go#L520: 	z.neg = false
		int.go#L578: 	if y.neg {
		int.go#L600: 	z.neg = len(z.abs) > 0 && x.neg && len(yWords) > 0 && yWords[0]&1 == 1 // 0 has no sign
		int.go#L601: 	if z.neg && len(mWords) > 0 {
		int.go#L604: 		z.neg = false
		int.go#L623: 		lenA, lenB, negA, negB := len(a.abs), len(b.abs), a.neg, b.neg
		int.go#L629: 		z.neg = false
		int.go#L635: 				x.neg = negA
		int.go#L643: 				y.neg = negB
		int.go#L730: 	z.neg = x.neg != neg
		int.go#L841: 	negA := a.neg
		int.go#L852: 			y.neg = !y.neg
		int.go#L861: 			x.neg = !x.neg
		int.go#L876: 	if n.neg || len(n.abs) == 0 {
		int.go#L877: 		z.neg = false
		int.go#L881: 	z.neg = false
		int.go#L892: 	if n.neg {
		int.go#L896: 	if g.neg {
		int.go#L910: 	if x.neg {
		int.go#L939: 	if b.neg {
		int.go#L940: 		if a.neg {
		int.go#L943: 		b.neg = false
		int.go#L1081: 	if x.neg || x.Cmp(p) >= 0 { // ensure 0 <= x < p
		int.go#L1101: 	z.neg = x.neg
		int.go#L1107: 	if x.neg {
		int.go#L1112: 		z.neg = true // z cannot be zero if x is negative
		int.go#L1117: 	z.neg = false
		int.go#L1134: 	if x.neg {
		int.go#L1151: 	if x.neg {
		int.go#L1155: 		z.neg = len(z.abs) > 0
		int.go#L1159: 	z.neg = false
		int.go#L1165: 	if x.neg == y.neg {
		int.go#L1166: 		if x.neg {
		int.go#L1171: 			z.neg = true // z cannot be zero if x and y are negative
		int.go#L1177: 		z.neg = false
		int.go#L1182: 	if x.neg {
		int.go#L1189: 	z.neg = false
		int.go#L1195: 	if x.neg == y.neg {
		int.go#L1196: 		if x.neg {
		int.go#L1201: 			z.neg = false
		int.go#L1207: 		z.neg = false
		int.go#L1211: 	if x.neg {
		int.go#L1215: 		z.neg = true // z cannot be zero if x is negative and y is positive
		int.go#L1222: 	z.neg = false
		int.go#L1228: 	if x.neg == y.neg {
		int.go#L1229: 		if x.neg {
		int.go#L1234: 			z.neg = true // z cannot be zero if x and y are negative
		int.go#L1240: 		z.neg = false
		int.go#L1245: 	if x.neg {
		int.go#L1252: 	z.neg = true // z cannot be zero if one of x or y is negative
		int.go#L1258: 	if x.neg == y.neg {
		int.go#L1259: 		if x.neg {
		int.go#L1264: 			z.neg = false
		int.go#L1270: 		z.neg = false
		int.go#L1275: 	if x.neg {
		int.go#L1282: 	z.neg = true // z cannot be zero if only one of x or y is negative
		int.go#L1288: 	if x.neg {
		int.go#L1291: 		z.neg = false
		int.go#L1297: 	z.neg = true // z cannot be zero if x is positive
		int.go#L1304: 	if x.neg {
		int.go#L1307: 	z.neg = false
		intconv.go#L25: 	return string(x.abs.itoa(x.neg, base))
		intconv.go#L34: 	return append(buf, x.abs.itoa(x.neg, base)...)
		intconv.go#L92: 	case x.neg:
		intconv.go#L192: 	z.neg = len(z.abs) > 0 && neg // 0 has no sign
		intmarsh.go#L25: 	if x.neg {
		intmarsh.go#L43: 	z.neg = b&1 != 0
		intmarsh.go#L75: 	return x.abs.itoa(x.neg, 10), nil
		natmul.go#L297: 	z1.neg = true
		prime.go#L39: 	if x.neg || len(x.abs) == 0 {
		rat.go#L63: 	z.a.neg = f < 0
		rat.go#L281: 	if x.a.neg {
		rat.go#L299: 	if x.a.neg {
		rat.go#L308: 	z.a.neg = a.neg != b.neg
		rat.go#L330: 		z.a.neg = !z.a.neg
		rat.go#L372: 	z.a.neg = false
		rat.go#L379: 	z.a.neg = len(z.a.abs) > 0 && !z.a.neg // 0 has no sign
		rat.go#L437: 		z.a.neg = false
		rat.go#L446: 		neg := z.a.neg
		rat.go#L447: 		z.a.neg = false
		rat.go#L448: 		z.b.neg = false
		rat.go#L453: 		z.a.neg = neg
		rat.go#L481: 	z.neg = x.neg
		rat.go#L530: 		z.a.neg = false
		rat.go#L559: 	z.a.neg = a.neg != b.neg
		ratconv.go#L205: 	z.a.neg = neg && len(z.a.abs) > 0 // 0 has no sign
		ratconv.go#L371: 	if x.a.neg {
		ratmarsh.go#L35: 	if x.a.neg {
		ratmarsh.go#L65: 	z.a.neg = b&1 != 0